Admission Control Policies of Queueing Systems
نویسندگان
چکیده
منابع مشابه
Queueing systems with leadtime constraints: A fluid-model approach for admission and sequencing control
We study how multi-product queueing systems should be controlled so that sojourn times (or end-to-end delays) do not exceed specified leadtimes. The network dynamically decides when to admit new arrivals and how to sequence the jobs in the system. To analyze this difficult problem, we propose an approach based on fluid-model analysis that translates the leadtime specifications into deterministi...
متن کاملDynamic scheduling in multiclass queueing networks: Stability under discrete-review policies
This paper describes a family of discrete-review policies for scheduling open multiclass queueing networks. Each of the policies in the family is derived from what we call a dynamic reward function: such a function associates with each queue length vector q and each job class k a positive value rk(q), which is treated as a reward rate for time devoted to processing class k jobs. Assuming that e...
متن کاملDynamic Policies of Admission to a Two—Class System Based on Customer Offers
We consider the problem of dynamic admission control in a Markovian loss queueing system with two classes of jobs with different service rates and random revenues. We establish the existence of an optimal monotone policy. We also show that under certain conditions there exist preferred jobs from
متن کاملAdmission control of multi-class traffic with service priorities in high-speed networks
We consider a fluid model of a system that handles multiple classes of traffic. The delay and cell-loss requirements of the different classes of traffic are generally widely different and are achieved by assigning different buffers for different classes, and serving them in a strict priority order. We use results from the effective bandwidth of the output processes (see Chang and Thomas (1995))...
متن کاملMarginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging
This paper addresses the problem of designing tractable dynamic admission control and/or routing policies in a Markovian model of parallel multi-server loss queues with reneging, which seek to optimize performance objectives of concern. Such problems are relevant in a variety of systems that provide distributed telecommunication or computing services. The paper shows the direct applicability of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003